منابع مشابه
Computing on Authenticated Data for Adjustable Predicates
The notion of P-homomorphic signatures, introduced by Ahn et al. (TCC 2012), generalizes various approaches for public computations on authenticated data. For a given predicate P anyone can derive a signature for a message m′ from the signatures of a set of messages M , as long as P(M,m′) = 1. This definition hence comprises notions and constructions for concrete predicates P such as homomorphi...
متن کاملComputing on Authenticated Data: New Privacy Definitions and Constructions
Homomorphic signatures are primitives that allow for public computations on authenticated data. At TCC 2012, Ahn et al. defined a framework and security notions for such systems. For a predicate P , their notion of P -homomorphic signature makes it possible, given signatures on a message set M , to publicly derive a signature on any message m′ such that P (M,m′) = 1. Beyond unforgeability, Ahn ...
متن کاملOn the Cost of Authenticated Data Structures
Authenticated data structures provide a model for data authentication, where answers to queries contain extra information that can produce a cryptographic proof about their validity. In this paper, we study the authentication cost that is associated with this model when authentication is performed through hierarchical cryptographic hashing. We introduce measures that precisely model the computa...
متن کاملAuthenticated Data Structures
Authenticated data structures are a model of computation where untrusted responders answer queries on a data structure on behalf of a trusted source and provide a proof of the validity of the answer to the user. We present a survey of techniques for designing authenticated data structures and overview their computational efficiency. We also discuss implementation issues and practical applications.
متن کاملStreaming Authenticated Data Structures
We consider the problem of streaming verifiable computation, where both a verifier and a prover observe a stream of n elements x1, x2, . . . , xn and the verifier can later delegate some computation over the stream to the prover. The prover must return the output of the computation, along with a cryptographic proof to be used for verifying the correctness of the output. Due to the nature of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2014
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-014-9182-0